A New Error and Erasure Decoding Approach for Cyclic Codes
نویسندگان
چکیده
A cyclic code is associated with another cyclic code to bound its minimum distance. The algebraic relation between these two codes allows the formulation of syndromes and a key equation. In this contribution, we outline the decoding approach for the case of errors and erasures and show how the Extended Euclidean Algorithm can be used for decoding.
منابع مشابه
New Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel
Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which...
متن کاملNew array codes for multiple phased burst correction
Abstmct-A new optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is presented. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts...
متن کاملUnequal error protection using LT codes and block duplication
Luby Transform (LT) codes are powerful packet erasure codes with low encoding and decoding complexity. We provide a simple method to improve the bit error rate performance of LT codes. Moreover, we exploit our method to design a new approach for unequal error protection with LT codes. We used simulations to compare our approach with a state of the art unequal error protection technique when the...
متن کاملML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms
The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density paritycheck (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum...
متن کاملML and Near-ML Decoding Performance of LDPC Codes over BEC: Bounds and Decoding Algorithms
Performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite length LDPC codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum of the Richardson-Urbanke ens...
متن کامل